Integer Solutions to Cutting Stock Problems
نویسندگان
چکیده
We consider two integer linear programming models for the one-dimensional cutting stock problem that include various difficulties appearing in practical real problems. Our primary goals are the minimization of the trim loss or the minimization of the number of master rolls needed to satisfy the orders. In particular, we study an approach based on the classical column-generation procedure by Gilmore and Gomory for solving the linear programming (LP) relaxations and an extra column-generation procedure before solving a final integer problem. For our computational tests we use some data sets from the paper industry and some others generated randomly.
منابع مشابه
The Modified Integer Round-Up Property of the One-Dimensional Cutting Stock Problem
A linear integer minimization problem (IP) has the modified integer round-up property (MIRUP) if the optimal value of any instance of IP is not greater than the optimal value of the corresponding LP relaxation problem rounded up plus one. The aim of this paper is to investigate numerically whether the MIRUP holds for the one-dimensional cutting stock problem. The computational experiments carri...
متن کاملThe Modiied Integer Round-up Property of the One-dimensional Cutting Stock Problem
A linear integer minimization problem (IP) has the modiied integer roundup property (MIRUP) if the optimal value of any instance of IP is not greater than the optimal value of the corresponding LP relaxation problem rounded up plus one. The aim of this paper is to investigate numerically whether the MIRUP holds for the one-dimensional cutting stock problem. The computational experiments carried...
متن کاملAn Algorithm for Two Dimensional Cutting Stock Problems with Demand
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...
متن کاملAn Algorithm for Two Dimensional Cutting Stock Problems with Demand
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...
متن کاملA branch-and-price algorithm for the two-stage guillotine cutting stock problem
We investigate the two-stage guillotine two-dimensional cutting stock problem. This problem commonly arises in the industry when small rectangular items need to be cut out of large stock sheets. We propose an integer programming formulation that extends the well-known Gilmore and Gomory model by explicitly considering solutions that are obtained by both slitting some stock sheets down their wid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010